Hereditary properties of permutations are strongly testable

نویسندگان

  • Tereza Klimosova
  • Daniel Král
چکیده

We show that for every hereditary permutation property P and every ε0 > 0, there exists an integer M such that if a permutation π is ε0far from P in the Kendall’s tau distance, then a random subpermutation of π of order M has the property P with probability at most ε0. This settles an open problem whether hereditary permutation properties are strongly testable, i.e., testable with respect to the Kendall’s tau distance, which is considered to be the edit distance for permutations. Our method also yields a proof of a conjecture of Hoppen, Kohayakawa, Moreira and Sampaio on the relation of the rectangular distance and the Kendall’s tau distance of a permutation from a hereditary property.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Easily Testable Graph Properties

A graph on n vertices is -far from a property P if one has to add or delete from it at least n edges to get a graph satisfying P. A graph property P is strongly testable (in the dense model) if for every fixed > 0 it is possible to distinguish, with one-sided error, between graphs satisfying P and ones that are -far from P by inspecting the induced subgraph on a random subset of at most f( ) ve...

متن کامل

The second dual of strongly zero-product preserving maps

The notion of strongly Lie zero-product preserving maps on normed algebras as a generalization of Lie zero-product preserving maps are dened. We give a necessary and sufficient condition from which a linear map between normed algebras to be strongly Lie zero-product preserving. Also some hereditary properties of strongly Lie zero-product preserving maps are presented. Finally the second dual of...

متن کامل

Testing perfection is hard

A graph property P is strongly testable if for every fixed > 0 there is a one-sided -tester for P whose query complexity is bounded by a function of . In classifying the strongly testable graph properties, the first author and Shapira showed that any hereditary graph property (such as P the family of perfect graphs) is strongly testable. A property is easily testable if it is strongly testable ...

متن کامل

Testing permutation properties through subpermutations

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said...

متن کامل

Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs

We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014